A Fast Polygon Scan conversion Algorithm about Non-horizontal Scan Lines 一个多边形快速斜扫描线填充算法
A New Efficient Straight Line Scan Conversion Algorithm 一个新的高效的直线扫描转换算法
In order to speed up the intersection, computation, an improved method is proposed in the paper by taking the advantages of polygon scan conversion algorithm for the exterior cell facets, and of geometric coherence for the interior cell facets. 本文利用平面多边形扫描算法求取光线与外部面的交点,井利用内部体元和面的相关性,改进了光线与内部面的求交计算,从而减少了运算量,提高了绘制速度。
This paper analyzes the minimal build mechanism in line scan conversion and presents a new scan algorithm. 深入研究了直线扫描转换的最小生成机制,提出一种扫描转化算法。
The typical polygon-filling algorithm covers the standard scan conversion algorithm and the edge-filling algorithm. 典型的多边形区域填充算法包括标准扫描线算法和边填充算法。